Simple Stochastic Temporal Constraint Networks

نویسندگان

  • Vadim Kirillov
  • Vasant Honavar
چکیده

Many artificial intelligence tasks (e.g., planning, situation assessment, scheduling) require reasoning about events in time. Temporal constraint networks offer an elegant and often computationally efficient framework for formulation and solution of such temporal reasoning tasks. Temporal data and knowledge available in some domains is necessarily imprecise e.g., as a result of measurement errors associated with sensors. This paper introduces stochastic temporal constraint networks thereby extending constraint-based approaches to temporal reasoning with precise temporal knowledge to handle stochastic imprecision. The paper proposes an algorithm for inference of implicit stochastic temporal constraints from a given set of explicit constraints. It also introduces a stochastic version of the temporal constraint network consistency verification problem and describes techniques for solving it under certain simplifying assumptions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Two-Stage Chance-Constraint Stochastic Programming Model for Electricity Supply Chain Network Design

Development of every society is incumbent upon energy sector’s technological and economic effectiveness. The electricity industry is a growing and needs to have a better performance to effectively cover the demand. The industry requires a balance between cost and efficiency through careful design and planning. In this paper, a two-stage stochastic programming model is presented for the design o...

متن کامل

Correlated sequence learning in a network of spiking neurons using maximum likelihood

Hopfield Networks are an idealised model of distributed computation in networks of non-linear, stochastic units. We consider the learning of correlated temporal sequences using Maximum Likelihood, deriving a simple Hebbian-like learning rule that is capable of robustly storing multiple sequences of correlated patterns. We argue that the learning rule is optimal for the case of long temporal seq...

متن کامل

Deductive and Inductive Methods for Program Synthesis

The paper discusses simple functional constraint networks and a value propagation method for program construction. Structural synthesis of programs is described as an example of deductive approach to program construction. An inductive method for program synthesis utilizing stochastic optimization algorithms is introduced to complement value propagation techniques.

متن کامل

Multi-item inventory model with probabilistic demand function under permissible delay in payment and fuzzy-stochastic budget constraint: A signomial geometric programming method

This study proposes a new multi-item inventory model with hybrid cost parameters under a fuzzy-stochastic constraint and permissible delay in payment. The price and marketing expenditure dependent stochastic demand and the demand dependent the unit production cost are considered. Shortages are allowed and partially backordered. The main objective of this paper is to determine selling price, mar...

متن کامل

Three Hybrid Metaheuristic Algorithms for Stochastic Flexible Flow Shop Scheduling Problem with Preventive Maintenance and Budget Constraint

Stochastic flexible flow shop scheduling problem (SFFSSP) is one the main focus of researchers due to the complexity arises from inherent uncertainties and also the difficulty of solving such NP-hard problems. Conventionally, in such problems each machine’s job process time may encounter uncertainty due to their relevant random behaviour. In order to examine such problems more realistically, fi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007